Parallel Monte Carlo on Intel MIC Architecture

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asian Option Pricing on Intel® MIC Architecture

In this paper, we discuss the problem of pricing one exotic option, the strong path dependent Asian option using the Black–Scholes model and compare how the pricing algorithm can be implemented on Intel® Many Integrated Core or MIC Architecture and achieve impressive performance gains. We can demonstrate that a 2-year contract with 252 times steps and 1,000,000 samples can be priced in approxim...

متن کامل

First experiences with the Intel MIC architecture at LRZ

With the rapidly growing demand for computing power new accelerator based architectures have entered the world of high performance computing since around 5 years. In particular GPGPUs have recently become very popular, however programming GPGPUs using programming languages like CUDA or OpenCL is cumbersome and errorprone. Trying to overcome these difficulties, Intel developed their own Many Int...

متن کامل

Parallel Monte Carlo Methods

This paper is the key paper in my Survey-based term project. The author argues that Monte Carlo algorithms are ideally suited to parallel computing, and that “parallel Monte Carlo” should be more widely used. Therefore I consider many of issues can be raised by use Parallel Monte Carlo method. And from this paper I also can discuss the possibilities of parallel Markov chain Monte Carlo which is...

متن کامل

Parallel Monte Carlo Tree Search on GPU

Monte Carlo Tree Search (MCTS) is a method for making optimal decisions in artificial intelligence (AI) problems, typically move planning in combinatorial games. It combines the generality of random simulation with the precision of tree search. It can theoretically be applied to any domain that can be described in terms of state, action pairs and simulation used to forecast outcomes such as dec...

متن کامل

Parallel Monte-Carlo Tree Search

Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2017

ISSN: 1877-0509

DOI: 10.1016/j.procs.2017.05.149